5 research outputs found
Application of Quasigroups in Cryptography and Data Communications
In the past decade, quasigroup theory has proven to be a fruitfull field for production of new cryptographic primitives and error-corecting codes. Examples include several finalists in the flagship competitions for new symmetric ciphers, as well as several assimetric proposals and cryptcodes. Since the importance of cryptography and coding theory for secure and reliable data communication can only grow within our modern society, investigating further the power of quasigroups in these fields is highly promising research direction.
Our team of researchers has defined several research objectives, which can be devided into four main groups:
1. Design of new cryptosystems or their building blocks based on quasigroups - we plan to make a classification of small quasigroups based on new criteria, as well as to identify new optimal 8βbit S-boxes produced by small quasigroups. The results will be used to design new stream and block ciphers.
2. Cryptanalysis of some cryptosystems based on quasigroups - we will modify and improve the existing automated tools for differential cryptanalysis, so that they can be used for prove the resistance to differential cryptanalysis of several existing ciphers based on quasigroups. This will increase the confidence in these ciphers.
3. Codes based on quasigroups - we will designs new and improve the existing error correcting codes based on combinatorial structures and quasigroups.
4. Algebraic curves over finite fields with their cryptographic applications - using some known and new tools, we will investigate the rational points on algebraic curves over finite fields, and explore the possibilities of applying the results in cryptography
ΠΠΎΠ΄ΠΎΠ±ΡΡΠ²Π°ΡΠ° Π²ΠΎ ΠΏΠΎΠ΄Π°ΡΠΎΡΠ½Π° ΠΊΠΎΠΌΡΠ½ΠΈΠΊΠ°ΡΠΈΡΠ°
ΠΡΡΡΠ°ΠΆΡΠ²Π°ΡΠ°ΡΠ° Π²ΠΎ ΠΎΠ²ΠΎΡ ΠΏΡΠΎΠ΅ΠΊΡ ΡΠ΅ Π±ΠΈΠ΄Π°Ρ Π²ΠΎ Π½Π΅ΠΊΠΎΠ»ΠΊΡ Π½Π°ΡΠΎΠΊΠΈ:
- ΠΡΠΏΠΈΡΡΠ²Π°ΡΠ΅ Π½Π° ΠΏΠ΅ΡΡΠΎΡΠΌΠ°Π½ΡΠΈΡΠ΅ Π½Π° ΠΊΡΠΈΠΏΡΠΎ-ΠΊΠΎΠ΄ΠΎΠ²ΠΈΡΠ΅ Π±Π°Π·ΠΈΡΠ°Π½ΠΈ Π½Π° ΠΊΠ²Π°Π·ΠΈΠ³ΡΡΠΏΠΈ Π·Π° ΠΊΠΎΡΠ΅ΠΊΡΠΈΡΠ° Π½Π° burst Π³ΡΠ΅ΡΠΊΠΈ.
- ΠΠ·ΡΠ°Π±ΠΎΡΠΊΠ° Π½Π° ΠΊΠ°ΡΠ°Π»ΠΎΠ³ Π·Π° ΠΏΡΠΈΠΌΠΈΡΠΈΠ²ΠΈ Π²ΠΎ Π»Π΅ΡΠ½Π°ΡΠ° ΠΊΡΠΈΠΏΡΠΎΠ³ΡΠ°ΡΠΈΡΠ° (lightweight cryptographic primitives).
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΠΏΡΠΈΠΌΠ΅ΡΠΈ Π½Π° Π±Π΅Π·Π±Π΅Π΄Π½ΠΎΡΠ½Π° Π΅Π²Π°Π»ΡΠ°ΡΠΈΡΠ° Π½Π° Π½Π΅ΠΊΠΎΠΈ Π΅Π½ΠΊΡΠΈΠΏΡΠΈΡΠΊΠΈ ΡΠ΅ΠΌΠΈ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΠΌΠΎΠΆΠ½ΠΎΡΡΠΈΡΠ΅ Π·Π° ΠΏΠΎΠ΄ΠΎΠ±ΡΡΠ²Π°ΡΠ΅ Π½Π° Blockchain ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΠΈΡΠ°ΡΠ°.
- OΠΏΡΠ΅Π΄Π΅Π»ΡΠ²Π°ΡΠ΅ Π½Π° Π½Π΅ΠΊΠΎΠΈ ΡΠ΅ΡΡΡΠ΅ Π½Π΅ΠΈΡΠΏΠΈΡΠ°Π½ΠΈ ΠΎΡΠΎΠ±ΠΈΠ½ΠΈ Π½Π° eΠ΄Π΅Π½ ΠΊΠΎΠ΄ Π·Π° Π΄Π΅ΡΠ΅ΠΊΡΠΈΡΠ° Π½Π° Π³ΡΠ΅ΡΠΊΠΈ
ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° Π½ΠΎΠ²ΠΈ ΠΌΠ΅ΡΠΎΠ΄ΠΈ Π·Π° ΠΏΠΎΠ΄ΠΎΠ±ΡΡΠ²Π°ΡΠ΅ Π½Π° Π±Π΅Π·Π±Π΅Π΄Π½ΠΎΡΡΠ° Π²ΠΎ ΠΏΠΎΠ΄Π°ΡΠΎΡΠ½Π°ΡΠ° ΠΊΠΎΠΌΡΠ½ΠΈΠΊΠ°ΡΠΈΡΠ°
- ΠΡΠΏΠΈΡΡΠ²Π°ΡΠ΅ Π½Π° ΠΏΠ΅ΡΡΠΎΡΠΌΠ°Π½ΡΠΈΡΠ΅ Π½Π° ΠΊΡΠΈΠΏΡΠΎ-ΠΊΠΎΠ΄ΠΎΠ²ΠΈΡΠ΅ Π±Π°Π·ΠΈΡΠ°Π½ΠΈ Π½Π° ΠΊΠ²Π°Π·ΠΈΠ³ΡΡΠΏΠΈ Π·Π° ΠΊΠΎΡΠ΅ΠΊΡΠΈΡΠ° Π½Π° burst Π³ΡΠ΅ΡΠΊΠΈ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΠΌΡΠ΅ΠΆΠ½ΠΈ ΠΏΡΠΎΡΠΎΠΊΠΎΠ»ΠΈ ΠΊΠΎΠΈ ΡΠ΅ ΠΊΠΎΡΠΈΡΡΠ°Ρ Π²ΠΎ IoT Π·Π° ΠΎΡΠΊΡΠΈΠ²Π°ΡΠ΅ Π½Π° Π½ΠΎΠ²ΠΈ ΡΠΊΡΠΈΠ΅Π½ΠΈ ΠΊΠ°Π½Π°Π»ΠΈ ΠΈ Π·Π°ΡΡΠΈΡΠ° ΠΎΠ΄ Π½ΠΈΠ².
- ΠΡΠ΅ΠΊΡ ΡΠΎΠΎΠ΄Π²Π΅ΡΠ½ΠΈ ΠΈΠ·ΠΌΠ΅Π½ΠΈ, ΡΠ΅ Π±ΠΈΠ΄Π΅ Π½Π°ΠΏΡΠ°Π²Π΅Π½ ΠΎΠ±ΠΈΠ΄ Π΄Π° ΡΠ΅ Π½Π°ΠΌΠ°Π»ΠΈ Π²Π΅ΡΠΎΡΠ°ΡΠ½ΠΎΡΡΠ° Π½Π° Π½Π΅ΠΎΡΠΊΡΠΈΠ΅Π½ΠΈ Π³ΡΠ΅ΡΠΊΠΈ Π½Π° Π΅Π΄Π΅Π½ ΠΊΠΎΠ΄ Π·Π° ΠΎΡΠΊΡΠΈΠ²Π°ΡΠ΅ Π½Π° Π³ΡΠ΅ΡΠΊΠΈ.
- ΠΡΠΏΠΈΡΡΠ²Π°ΡΠ΅ Π½Π° ΠΏΠ΅ΡΡΠΎΡΠΌΠ°Π½ΡΠΈΡΠ΅ Π½Π° ΠΊΡΠΈΠΏΡΠΎ ΠΊΠΎΠ΄ΠΎΠ²ΠΈΡΠ΅ Π±Π°Π·ΠΈΡΠ°Π½ΠΈ Π½Π° ΠΊΠ²Π°Π·ΠΈΠ³ΡΡΠΏΠΈ Π·Π° ΠΏΡΠ΅Π½ΠΎΡ Π½Π° ΡΠ»ΠΈΠΊΠΈ Π½ΠΈΠ· Gilbert-Elliot burst ΠΊΠ°Π½Π°Π»ΠΎΡ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΠΌΠΎΠΆΠ½ΠΎΡΡΠΈΡΠ΅ Π·Π° ΠΏΡΠΈΠΌΠ΅Π½Π° Π½Π° ΠΊΠ²Π°Π·ΠΈΠ³ΡΡΠΏΠ½ΠΈ ΡΡΠ°Π½ΡΡΠΎΡΠΌΠ°ΡΠΈΠΈ Π·Π° ΠΊΠΎΠ΄ΠΈΡΠ°ΡΠ΅ Π²ΠΎ peer to peer ΠΌΡΠ΅ΠΆΠΈ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° Π±Π΅Π·Π±Π΅Π΄Π½ΠΎΡΡΠ° ΠΏΡΠΈ ΡΠΏΡΠ°Π²ΡΠ²Π°ΡΠ΅ ΡΠΎ ΡΠΈΠ·ΠΈΡΠΈ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΠΏΡΠΈΠΌΠ΅ΡΠΈ Π½Π° Π±Π΅Π·Π±Π΅Π΄Π½ΠΎΡΠ½Π° Π΅Π²Π°Π»ΡΠ°ΡΠΈΡΠ° Π½Π° Π½Π΅ΠΊΠΎΠΈ Π΅Π½ΠΊΡΠΈΠΏΡΠΈΡΠΊΠΈ ΡΠ΅ΠΌΠΈ.
- ΠΠ½Π°Π»ΠΈΠ·Π° Π½Π° ΠΌΠΎΠΆΠ½ΠΎΡΡΠΈΡΠ΅ Π·Π° ΠΏΠΎΠ΄ΠΎΠ±ΡΡΠ²Π°ΡΠ΅ Π½Π° Blockchain ΡΠ΅Ρ
Π½ΠΎΠ»ΠΎΠ³ΠΈΡΠ°ΡΠ°.
- OΠΏΡΠ΅Π΄Π΅Π»ΡΠ²Π°ΡΠ΅ Π½Π° Π½Π΅ΠΊΠΎΠΈ ΡΠ΅ΡΡΡΠ΅ Π½Π΅ΠΈΡΠΏΠΈΡΠ°Π½ΠΈ ΠΎΡΠΎΠ±ΠΈΠ½ΠΈ Π½Π° eΠ΄Π΅Π½ ΠΊΠΎΠ΄ Π·Π° Π΄Π΅ΡΠ΅ΠΊΡΠΈΡΠ° Π½Π° Π³ΡΠ΅ΡΠΊΠΈ
Gaussian channel transmission of images and audio files using cryptcoding
Random codes based on quasigroups (RCBQ) are cryptcodes, i.e. they are error-correcting codes, which provide information security. Cut-Decoding and 4-Sets-Cut-Decoding algorithms for these codes are defined elsewhere. Also, the performance of these codes for the transmission of text messages is investigated elsewhere. In this study, the authors investigate the RCBQ's performance with Cut-Decoding and 4-Sets-Cut-Decoding algorithms for transmission of images and audio files through a Gaussian channel. They compare experimental results for both coding/decoding algorithms and for different values of signal-to-noise ratio. In all experiments, the differences between the transmitted and decoded image or audio file are considered. Experimentally obtained values for bit-error rate and packet error rate and the decoding speed of both algorithms are compared. Also, two filters for enhancing the quality of the images decoded using RCBQ are proposed